منابع مشابه
Subword histories and associated matrices
The basic numerical quantity investigated in this paper is |w|u, the number of occurrences of a word u as a scattered subword of a word w. Arithmetical combinations of such quantities yield a so-called subword history. We investigate the information content of subword histories. Reducing subword histories to linear ones, as well as the recently introduced Parikh matrices, will be important tool...
متن کاملOn Inequalities between Subword Histories
By taking out letters from a word we get a subword. Both continuous sub-words (also called factors or simply subwords) and scattered subwords were extensively studied. In [4] the authors introduced Parikh matrices, structures that contain more information about the words than Parikh vectors, which tell us only the number of di $ffere\tau 1T$ letters building the word. $I_{l1}[5]$ the notion of ...
متن کاملSubword complexities and iteration
This paper is an overview of results' on the subword complexity of various classes of languages obtained by iterating a mapping, and more precisely on the asymptotic behaviour of this complexity. In the first section we consider iterated morphisms, that is DOL languages. In this area the subword complexity falls into one of five classes, and class membership can be determined. The second sectio...
متن کاملOn scattered subword complexity
Sequences of characters called words or strings are widely studied in combinatorics, and used in various fields of sciences (e.g. chemistry, physics, social sciences, biology [2, 3, 4, 11] etc.). The elements of a word are called letters. A contiguous part of a word (obtained by erasing a prefix or/and a suffix) is a subword or factor. If we erase arbitrary letters from a word, what is obtained...
متن کاملSubword-Based Text Retrieval
Document retrieval in languages with a rich and complex morphology – particularly in terms of derivation and (single-word) composition – suffers from serious performance degradation with the stemming-only query-term-totext-word matching paradigm. We propose an alternative approach in which morphologically complex word forms are segmented into relevant subwords (such as stems, prefixes, suffixes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2006
ISSN: 0890-5401
DOI: 10.1016/j.ic.2006.09.003